The Mixed Chinese Postman Problem
نویسندگان
چکیده
منابع مشابه
On the mixed Chinese postman problem
The mixed Chinese postman problem is a version of the well-known Chinese postman problem in which the underlying graph consists of both directed and undirected edges. We give an integer linear programming formulation for this problem and then show that the extreme points of its linear relaxation polyhedron are all half-integral. keywords: Chinese postman problem, half-integrality, graph, flow
متن کاملThe Mixed Chinese Postman Problem Parameterized by Pathwidth and Treedepth
In the mixed Chinese postman problem (MCPP), given a weighted mixed graph G (it may have both edges and arcs), our aim is to find a closed walk of minimum weight traversing each edge and arc at least once. The MCPP parameterized by the number of edges in G or the number of arcs in G is fixed-parameter tractable as proved by van Bevern et al. in 2014 and Gutin, Jones, and Sheng in 2014, respecti...
متن کاملImproved solutions for the Chinese postman problem on mixed networks
The Chinese postman problem (CPP) is that of finding the shortest postman tour covering all the roads in the network. The CPP is polynomial-time solvable on totally directed or undirected networks, but is NP-complete on mixed networks (MCPP). Several heuristic solution procedures including Mixed-1, Mixed-2, Modified Mixed-1, and Modified Mixed-2 algorithms, have been proposed to solve the probl...
متن کاملThe directed Chinese Postman Problem
The Chinese Postman Problem has many applications, including robot exploration, and analysing interactive system and web site usability. This paper reviews the wide range of applications of the problem and presents complete, executable code to solve it for the case of directed multigraphs. A variation called the ‘open Chinese Postman Problem’ is also introduced and solved. Although optimisation...
متن کاملStructural Parameterizations of the Mixed Chinese Postman Problem
In the Mixed Chinese Postman Problem (MCPP), given a weighted mixed graph G (G may have both edges and arcs), our aim is to find a minimum weight closed walk traversing each edge and arc at least once. The MCPP parameterized by the number of edges in G or the number of arcs in G is fixed-parameter tractable as proved by van Bevern et al. (in press) and Gutin, Jones and Sheng (ESA 2014), respect...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Institute for System Programming of the RAS
سال: 2017
ISSN: 2079-8156,2220-6426
DOI: 10.15514/ispras-2017-29(4)-7